Keg Master: a Graph-Aware Visual Editor for 3D Graphs
نویسندگان
چکیده
This paper presents Keg Master, a graph-aware visual editor for 3D graphs. Keg Master is novel in that it works with a graph description language as opposed to a scene graph description language. Keg Master supports a range of 3D graph operations. Graphs may be stored to and retrieved from files. A range of objects may be added to a graph, cone, cube, sphere, and edge. Attributes may be specified to the nodes and edges. These properties of edges may interactively changed to allow users to better understand the graphic structure.
منابع مشابه
Keg Master: a Graph-Aware Visual Editor for Scene Graphs
This paper describes the manner in which papers should be formatted for papers adhering to the ACS series, Conference in Research and Practice in Information Technology. The abstract should be a maximum of 250 words and should clearly identify the content of the paper. The text in the abstract should be in style "abstract text". Note that the best way I have found to get the styles correct is t...
متن کاملWebKB-GE - A Visual Editor for Canonical Conceptual Graphs (Research Note)
This paper reports a CG editor implementation which uses canonical formation as the direct manipulation metaphore. The editor is written in Java and embedded within the WekKB indexation tool. The user's mental map is explicitly supported by a separate representation of a graph's visual layout. In addition, cooperative knowledge formulation is supported by network-aware work-sharing features. Th...
متن کاملdesigning and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملA Turán Theorem for Random Graphs Dean of the Graduate School Date a Turán Theorem for Random Graphs a Turán Theorem for Random Graphs
of a thesis submitted to the Faculty of the Graduate School of Emory University in partial fulfillment of the requirements of the degree of Master of Science Department of Mathematics and Computer Science
متن کامل